Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear timeBRANDSTÄDT, Andreas; MAHFUD, Suhail.Information processing letters. 2002, Vol 84, Num 5, pp 251-259, issn 0020-0190, 9 p.Article

On robust algorithms for the Maximum Weight Stable Set ProblemBRANDSTÄDT, Andreas.Lecture notes in computer science. 2001, pp 445-458, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Dominating Induced Matchings for P₇-Free Graphs in Linear TimeBRANDSTÄDT, Andreas; MOSCA, Raffaele.Algorithmica. 2014, Vol 68, Num 4, pp 998-1018, issn 0178-4617, 21 p.Article

Maximum Induced Matchings for Chordal Graphs in Linear TimeBRANDSTÄDT, Andreas; HOANG, Chinh T.Algorithmica. 2008, Vol 52, Num 4, pp 440-447, issn 0178-4617, 8 p.Article

On variations of P₄-sparse graphsBRANDSTÄDT, Andreas; MOSCA, Raffaele.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 521-532, issn 0166-218X, 12 p.Article

On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set ProblemBRANDSTÄDT, Andreas; HOANG, Chinh T.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 295-306, issn 0304-3975, 12 p.Article

Structure and linear time recognition of 3-leaf powersBRANDSTÄDT, Andreas; VAN BANG LE.Information processing letters. 2006, Vol 98, Num 4, pp 133-138, issn 0020-0190, 6 p.Article

Split-perfect graphs: Characterizations and algorithmic useBRANDSTÄDT, Andreas; VAN BANG LE.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 3, pp 341-360, issn 0895-4801, 20 p.Article

On linear and circular structure of (claw, net)-free graphsBRANDSTÄDT, Andreas; DRAGAN, Feodor F.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 285-303, issn 0166-218X, 19 p.Article

A note on α-redundant vertices in graphsBRANDSTÄDT, Andreas; LOZIN, V. V.Discrete applied mathematics. 2001, Vol 108, Num 3, pp 301-308, issn 0166-218XArticle

Characterising (k, ℓ)-leaf powersBRANDSTÄDT, Andreas; WAGNER, Peter.Discrete applied mathematics. 2010, Vol 158, Num 2, pp 110-122, issn 0166-218X, 13 p.Article

Graph-theoretic concepts in computer science (Boltenhagen, 14-16 June 2001)Brandstädt, Andreas; Van Bang Le.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42707-4, X, 327 p, isbn 3-540-42707-4Conference Proceedings

(P₅, diamond)-free graphs revisited: structure and linear time optimizationBRANDSTÄDT, Andreas.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 13-27, issn 0166-218X, 15 p.Conference Paper

Linear time algorithms for hamiltonian problems on (claw, net)-free graphsBRANDSTÄDT, Andreas; DRAGAN, Feodor F; KÖHLER, Ekkehard et al.SIAM journal on computing (Print). 2001, Vol 30, Num 5, pp 1662-1677, issn 0097-5397Article

INDEPENDENT SETS OF MAXIMUM WEIGHT IN APPLE-FREE GRAPHSBRANDSTÄDT, Andreas; LOZIN, Vadim V; MOSCA, Raffaele et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 239-254, issn 0895-4801, 16 p.Article

Structure and stability number of chair-, co-P-and gem-free graphs revisitedBRANDSTÄDT, Andreas; LE, Hoang-Oanh; VANHERPE, Jean-Marie et al.Information processing letters. 2003, Vol 86, Num 3, pp 161-167, issn 0020-0190, 7 p.Article

On α-redundant vertices in P₅-free graphsBRANDSTÄDT, Andreas; LE, Hoang-Oanh; VAN BANG LE et al.Information processing letters. 2002, Vol 82, Num 3, pp 119-122, issn 0020-0190Article

On the structure and stability number of P₅- and co-chair-free graphsBRANDSTÄDT, Andreas; MOSCA, Raffaele.Discrete applied mathematics. 2003, Vol 132, Num 1-3, pp 47-65, issn 0166-218X, 19 p.Article

On stable cutsets in line graphsVAN BANG LE; RANDERATH, Bert.Lecture notes in computer science. 2001, pp 263-271, issn 0302-9743, isbn 3-540-42707-4Conference Paper

On strong Menger-connectivity of star graphsEUNSEUK OH; JIANER CHEN.Lecture notes in computer science. 2001, pp 272-283, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Critical and anticritical edges in perfect graphsWAGLER, Annegret.Lecture notes in computer science. 2001, pp 317-327, issn 0302-9743, isbn 3-540-42707-4Conference Paper

The complexity of the matching-cut problemPATRIGNANI, Maurizio; PIZZONIA, Maurizio.Lecture notes in computer science. 2001, pp 284-295, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Split-perfect graphs : Characterizations and algorithmic useBRANDSTÄDT, Andreas; VAN BANG LE.Lecture notes in computer science. 2000, pp 71-82, issn 0302-9743, isbn 3-540-41183-6Conference Paper

Exact leaf powersBRANDSTÄDT, Andreas; VAN BANG LE; RAUTENBACH, Dieter et al.Theoretical computer science. 2010, Vol 411, Num 31-33, pp 2968-2977, issn 0304-3975, 10 p.Article

The induced matching and chain subgraph cover problems for convex bipartite graphsBRANDSTÄDT, Andreas; ESCHEN, Elaine M; SRITHARAN, R et al.Theoretical computer science. 2007, Vol 381, Num 1-3, pp 260-265, issn 0304-3975, 6 p.Article